Formulating and solving integrated order batching and routing in multi-depot AGV-assisted mixed-shelves warehouses
نویسندگان
چکیده
Different retail and e-commerce companies are facing the challenge of assembling large numbers time-critical picking orders that include both small-line multi-line orders. To reduce unproductive picker working time as in traditional picker-to-parts warehousing systems, different solutions proposed literature practice. For example, a mixed-shelves storage policy, items same stock keeping unit spread over several shelves warehouse; or automated guided vehicles (AGVs) used to transport picked from area packing stations instead human pickers. This is first paper combine solutions, creating what we call AGV-assisted systems. We model new integrated order batching routing problem such systems an extended multi-depot vehicle with three-index two-commodity network flow formulations. Due complexity problem, develop novel variable neighborhood search algorithm solve more efficiently. test our methods sizes instances, conclude policy suitable than usual for lines (saving up 62% on driving distances AGVs). Our provides optimal within acceptable computational time.
منابع مشابه
Order batching in multi-server pick-and-sort warehouses i
In many warehouses, customer orders are batched to profit from a reduction in the order picking effort. This reduction has to be offset against an increase in sorting effort. This paper studies the impact of the order batching policy on average customer order throughput time, in warehouses where the picking and sorting functions are executed separately by either a single operator or multiple pa...
متن کاملOptimally solving the joint order batching and picker routing problem
In this work we investigate the problem of order batching and picker routing in storage areas. These are labour and capital intensive problems, often responsible for a substantial share of warehouse operating costs. In particular, we consider the case of online grocery shopping in which orders may be composed of dozens of items. We present a formulation for the problem based on an exponential n...
متن کاملIntegrated Order Batching and Distribution Scheduling in a Single-block Order Picking Warehouse Considering S-Shape Routing Policy
In this paper, a mixed-integer linear programming model is proposed to integrate batch picking and distribution scheduling problems in order to optimize them simultaneously in an order picking warehouse. A tow-phase heuristic algorithm is presented to solve it in reasonable time. The first phase uses a genetic algorithm to evaluate and select permutations of the given set of customers. The seco...
متن کاملModeling and Solving the Multi-depot Vehicle Routing Problem with Time Window by Considering the Flexible end Depot in Each Route
This paper considers the multi-depot vehicle routing problem with time window in which each vehicle starts from a depot and there is no need to return to its primary depot after serving customers. The mathematical model which is developed by new approach aims to minimizing the transportation cost including the travelled distance, the latest and the earliest arrival time penalties. Furthermore, ...
متن کاملSolving the Multi-depot Location- Routing Problem with Lagrangian Relaxation
Multi-depot Location-Routing Problem (MDLRP) is about finding the optimal number and locations of depots while allocating customers to depots and determining vehicle routes to visit all customers. In this study we propose a nested Lagrangian relaxation-based method for the discrete uncapacitated MDLRP. An outer Lagrangian relaxation embedded in subgradient optimization decomposes the parent pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2023
ISSN: ['1872-6860', '0377-2217']
DOI: https://doi.org/10.1016/j.ejor.2022.08.047